Description: 是关于CPU进程调度的模拟程序，可以实现三种算法的进程调度：先来先服务，短进程优先，最高优先级。是操作系统的大作业。-is on the CPU scheduling process simulation program that can be achieved in three of process scheduling algorithm : first-come first-serve, short process priority, the highest priority. The operating system is operating. Platform: |
Size: 129067 |
Author:赵佳 |
Hits:
Description: 处理机调度，编写一个进程调度程序，允许多个进程共行的进程调度程序。
进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）和先来先服务算法。
每个进程有一个进程控制块（PCB）表示。进程控制块可以包含如下信息：进程名、优先数、到达时间、需要运行时间、已用CPU时间、进程状态等等。
进程的优先数及需要的运行时间可以事先人为地指定（也可以由随机数产生）。进程的到达时间为输入进程的时间。
进程的运行时间以时间片为单位进行计算。
每个进程的状态可以是就绪 W（Wait）、运行R（Run）、或完成F（Finish）三种状态之一。
就绪进程获得 CPU后都只能运行一个时间片。用已占用CPU时间加1来表示。
如果运行一个时间片后，进程的已占用 CPU时间已达到所需要的运行时间，则撤消该进程，如果运行一个时间片后进程的已占用CPU时间还未达所需要的运行时间，也就是进程还需要继续运行，此时应将进程的优先数减1（即降低一级），然后把它插入就绪队列等待CPU。
每进行一次调度程序都打印一次运行进程、就绪队列、以及各个进程的 PCB，以便进行检查。
重复以上过程，直到所要进程都完成为止
-processor scheduling, the preparation of a process scheduling procedures, allowing a total of more than process the process scheduler. Process scheduling algorithm : Highest priority for priority scheduling algorithm (namely processors allocated to the highest priority in the process) and a first-come first-service algorithm . Each process is a process control block (PCB) said. Process control block may contain the following information : process, and a number of priority, arriving in time, the running time, CPU has spent time, the process of the state and so on. Several priorities for the process of the operation and needs time to be designated prior to artificially (and also by the random number generator). The arrival process for the importation process of time. The process of running t Platform: |
Size: 101345 |
Author:王山 |
Hits:
Description: 题目：N个进程的调度程序
算法：采用最高优先数优先的调度算法和先来先服务算法
-topics : N process scheduler algorithm : the highest priority for priority scheduling algorithm and a first-come first-service algorithm Platform: |
Size: 2763 |
Author:周子藤 |
Hits:
Description: 对进程调度与作业调度的模拟,进程调度算法：采用的是最高优先数优先的高度算法（即把处理机分配给优先数最高的进程和先来先服务算法。分区分配和回收算法：采用首次适应算法和最佳适应算法实现动态分区。其中，空闲分区通过空闲分区链来管理，在进行内存分配时，系统优先使用空闲区低端的空间。-process of scheduling and job scheduling simulation and process scheduling algorithm : the highest priority is the high number of priority algorithm (that is, processors allocated to the highest priority to the process and the first-come first-serve count France. through distribution and recovery algorithm : the first and best adaptation algorithm to adapt to dynamic partitioning algorithm. Among them, through idle through to idle through chain management, carrying out memory allocation, the system priority in the use of low-end leisure area of space. Platform: |
Size: 76800 |
Author:陈任全 |
Hits:
Description: 是关于CPU进程调度的模拟程序，可以实现三种算法的进程调度：先来先服务，短进程优先，最高优先级。是操作系统的大作业。-is on the CPU scheduling process simulation program that can be achieved in three of process scheduling algorithm : first-come first-serve, short process priority, the highest priority. The operating system is operating. Platform: |
Size: 129024 |
Author:好想见到你 |
Hits:
Description: 处理机调度，编写一个进程调度程序，允许多个进程共行的进程调度程序。
进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）和先来先服务算法。
每个进程有一个进程控制块（PCB）表示。进程控制块可以包含如下信息：进程名、优先数、到达时间、需要运行时间、已用CPU时间、进程状态等等。
进程的优先数及需要的运行时间可以事先人为地指定（也可以由随机数产生）。进程的到达时间为输入进程的时间。
进程的运行时间以时间片为单位进行计算。
每个进程的状态可以是就绪 W（Wait）、运行R（Run）、或完成F（Finish）三种状态之一。
就绪进程获得 CPU后都只能运行一个时间片。用已占用CPU时间加1来表示。
如果运行一个时间片后，进程的已占用 CPU时间已达到所需要的运行时间，则撤消该进程，如果运行一个时间片后进程的已占用CPU时间还未达所需要的运行时间，也就是进程还需要继续运行，此时应将进程的优先数减1（即降低一级），然后把它插入就绪队列等待CPU。
每进行一次调度程序都打印一次运行进程、就绪队列、以及各个进程的 PCB，以便进行检查。
重复以上过程，直到所要进程都完成为止
-processor scheduling, the preparation of a process scheduling procedures, allowing a total of more than process the process scheduler. Process scheduling algorithm : Highest priority for priority scheduling algorithm (namely processors allocated to the highest priority in the process) and a first-come first-service algorithm . Each process is a process control block (PCB) said. Process control block may contain the following information : process, and a number of priority, arriving in time, the running time, CPU has spent time, the process of the state and so on. Several priorities for the process of the operation and needs time to be designated prior to artificially (and also by the random number generator). The arrival process for the importation process of time. The process of running t Platform: |
Size: 101376 |
Author:王山 |
Hits:
Description: 题目：N个进程的调度程序
算法：采用最高优先数优先的调度算法和先来先服务算法
-topics : N process scheduler algorithm : the highest priority for priority scheduling algorithm and a first-come first-service algorithm Platform: |
Size: 2048 |
Author:周子藤 |
Hits:
Description: 作业调度管理，它采用了三种算法，分别是先来先服务、响应最高比优先、最短作业优先算法进行调度-Job scheduling management, it uses three types of algorithms, which are first-come, first service, in response to the highest priority than the shortest operating priority scheduling algorithm Platform: |
Size: 2048 |
Author:feng |
Hits:
Description: 一、目的要求
用高级语言编写和调试一个进程调度程序，以加深对进程的概念及进程调度算法的理解。
二、例题： 设计一个有 N个进程共行的进程调度程序。
进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）和先来先服务算法。
每个进程有一个进程控制块（ PCB）表示。进程控制块可以包含如下信息：进程名、优先数、到达时间、需要运行时间、已用CPU时间、进程状态等等。
-First, the purpose of high-level language requires a process of writing and debugging scheduling procedures in order to deepen their understanding of the process of the concept and understanding of the process of scheduling algorithm. Second, Example: Design of a total of N months the process of the process of scheduling procedures. The process of scheduling algorithm: The number of priority of the highest priority scheduling algorithm (that is, the number of processors allocated to the highest priority to the process) and first-come first-serve algorithm. Each process is a process control block (PCB) said. Process control block can contain the following information: the process name, priority number, arrival time, need to run the time, has spent CPU time, the process of state and so on. Platform: |
Size: 74752 |
Author:Anson |
Hits:
Description: 进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）和先来先服务算法。
每个进程有一个进程控制块（ PCB）表示。进程控制块可以包含如下信息：进程名、优先数、到达时间、需要运行时间、已用CPU时间、进程状态等等。
进程优先数及需要的运行时间可以事先人为地指定（也可以由随机数产生）。进程的到达时间为进程输入的时间。进程的运行时间以时间片为单位进行计算。
-The process of scheduling algorithms: the use of the highest priority number of priority scheduling algorithm (ie the number of processors allocated to the highest priority process) and first-come first-serve algorithm. Each process has a process control block (PCB) said. Process control block can contain the following information: process name, priority number, arrival time, the need for run-time, has spent CPU time, the process of state and so on. Process priority number and needs of the running time can be artificially designated in advance (you can also by the random number generator). Process input arrival time for the process time. The process of running time to time slice is calculated as a unit. Platform: |
Size: 1024 |
Author:110 |
Hits:
Description: 利用最高优先数优先和先进先服务两种算法分别对进程进行管理调度-The highest priority use of a number of priority and advanced first serve, respectively, of two algorithms to manage the process of scheduling Platform: |
Size: 540672 |
Author:张小虎 |
Hits:
Description: 才用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）和先来先服务算法-Only the highest priority with a number of priority scheduling algorithm (that is, the number of processors allocated to the highest priority of the process) and the first-come first-serve algorithm Platform: |
Size: 1024 |
Author:谭仲 |
Hits:
Description: 设计一个有 N个进程并行的进程调度程序,采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）和先来先服务算法.-Design of a parallel process, N a process scheduler, using the highest priority number of priority scheduling algorithm (ie the number of processors allocated to the highest priority to the process), and a first-come, first-served algorithm. Platform: |
Size: 111616 |
Author:魏忠祥 |
Hits:
Description: 编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对五个进程进行调度。
“最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。
动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。例如：在进程获得一次CPU后就将其优先数减少1，或者，进程等待的时间超过某一时限时增加其优先数的值，等等。
-Write and debug a simulation of the process scheduler, using the "highest priority number priority" scheduling process scheduling algorithm to five.
The "highest priority number first" scheduling algorithm the basic idea is to CPU allocated to the highest-priority ready queue in the process. Static priority number is determined when creating the process, and in the whole process will not change during the operation.
Dynamic priority number refers to the process of creating a process priority number can be given an initial value, and can modify the priority number according to certain principles. For example: access to a CPU in the process after one of its priority to reduce the number of, or the process to wait longer than a certain time limit, increase the number of its priority value, and so on. Platform: |
Size: 1024 |
Author:sylvia |
Hits:
Description: 模拟系统进程调度，才用最高优先数优先算法，操作系统课程实验-Process scheduling simulation system, only the number with the highest priority first algorithm, operating systems course experiment Platform: |
Size: 3072 |
Author:ghoenix |
Hits:
Description: 操作系统进程调度，包括最高优先数优先算法、简单时间片轮转调度算法、多级反馈队列调度算法-Operating system process scheduling, including the highest priority first algorithm, a simple time-slice round-robin scheduling algorithm, multi-level feedback queue scheduling algorithm Platform: |
Size: 242688 |
Author:潘宝 |
Hits:
Description: 用C语言实现对N（N=5）个进程的调度模拟，可以采用优先权高者优先算法Highest Priority First等，分别进行模拟调度。
-Realization of N (N = 5) a process of scheduling simulation using C language, you can use the higher priority Highest Priority First Priority algorithm, etc., were simulated scheduling. Platform: |
Size: 442368 |
Author:梁欣妍 |
Hits:
Search - highest priority first